Rectilinear Distance in Rotated Regular Point Patterns
نویسنده
چکیده
This paper examines the relationship between road directions and the rectilinear distance in regular point patterns. We derive the distributions of the rectilinear distances to the nearest and the second nearest points in rotated regular point patterns. These distributions demonstrate that road directions significantly affect the rectilinear distances. As an application of the nearest and the second nearest distances, we consider a facility location problem in which customers are serviced by either the nearest or the second nearest facility.
منابع مشابه
Analysis of Facility Location Using Ordered Rectilinear Distance in Regular Point Patterns
This paper deals with the kth nearest rectilinear distance of two regular point patterns: square and diamond lattices. The probability density functions of the kth nearest rectilinear distance are theoretically derived for k = 1, 2, . . . , 8. Upper and lower bounds of the kth nearest distance are also derived. As an application of the kth nearest distance, we consider a facility location probl...
متن کاملAn Approximation for the Kth Nearest Distance and Its Application to Locational Analysis
In this paper, we provide a simple approximation for the distance from an arbitrary location to the kth nearest point. Distance is measured as the Euclidean and the rectilinear distances on a continuous plane. The approximation demonstrates that the kth nearest distance is proportional to the square root of k and inversely proportional to the square root of the density of points. The accuracy o...
متن کاملComputing the Rectilinear Center of Uncertain Points in the Plane
In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set P of n (weighted) uncertain points in the plane and each uncertain point has m possible locations each associated with a probability for the point appearing at that location. The goal is to find a point q∗ in the plane which minimizes the maximum expected rectiline...
متن کاملk-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
We present an algorithm for computing k-link rectilinear shortest paths among rectilinear obstacles in the plane. We extend the “continuous Dijkstra” paradigm to store the link distance information associated with each propagating “wavefront”. Our algorithm runs in time O(kn log n) and space O(kn), where n is the number of vertices of the obstacles. Previous algorithms for the problem had worst...
متن کاملGeometric Applications Of Posets
We show the power of posets in computational geometry by solving several problems posed on a set S of n points in the plane: (1) nd the n ? k ? 1 rectilinear farthest neighbors (or, equivalently, k nearest neighbors) to every point of S (extendable to higher dimensions), (2) enumerate the k largest (smallest) rectilinear distances in decreasing (increasing) order among the points of S, (3) give...
متن کامل